1·Automata theory is an important component of computer science.
自动机理论是计算机科学理论的重要组成部分。
2·Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直觉模糊自动机理论是自动机理论的一个重要分支。
3·Unfortunately, automata theory tells us that no tool could ever statically determine which programs will throw null-pointer exceptions.
不幸的是，自动控制理论告诉我们，没有工具可以静态地决定哪些程序将抛出空指针异常。
4·The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
5·The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA 分子的可计算性及其计算能力。
6·In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
7·The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
8·Otherwise, this paper also discusses the theory of cellular automata itself, tries to put fuzzy logic into the cellular automata, and gives the definition of fuzzy cellular automata.
另外，本文也对模糊元胞自动机理论本身进行了探讨，尝试着将模糊逻辑引入到元胞自动机模型中，定义了模糊元胞自动机。
9·Secondly, some correction and enhancement are made to the theory of interface automata, and then the revised theory is applied to the compositional analysis and verification of software architectures.
然后在此基础上对接口自动机理论进行了完善，并研究了该理论在软件体系结构的组合分析与验证中的应用。
10·The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。